New strategy for searching disturbance vector of SHA-1 collision attack
نویسندگان
چکیده
منابع مشابه
New Disturbance Vector for SHA-0 Collision
Most of recent collision attacks on SHA-0 are based on the differential path given by Xiaoyun Wang et al. Their disturbance vector was thought to be the best one. We noticed that the way they calculate number of sufficient conditions is not accurate, and we also found some new properties of the third Boolean function MAJ (b ∧ c) ∨ (c ∧ d) ∨ (d ∧ b). In this paper we present a new disturbance ve...
متن کاملFreestart Collision for Full SHA-1
We present in this article a freestart collision example for SHA-1, i.e., a collision for its internal compression function. This is the first practical break of the full SHA-1, reaching all 80 out of 80 steps, while only 10 days of computation on a 64 GPU cluster were necessary to perform the attack. This work builds on a continuous series of cryptanalytic advancements on SHA-1 since the theor...
متن کاملThe First Collision for Full SHA-1
SHA-1 is a widely used 1995 NIST cryptographic hash function standard that was officially deprecated by NIST in 2011 due to fundamental security weaknesses demonstrated in various analyses and theoretical attacks. Despite its deprecation, SHA-1 remains widely used in 2017 for document and TLS certificate signatures, and also in many software such as the GIT versioning system for integrity and b...
متن کاملClassification and generation of disturbance vectors for collision attacks against SHA-1
The main contribution of this paper is to provide a classification of disturbance vectors used in differential collision attacks against SHA-1. We show that all published disturbance vectors can be classified into two types of vectors, type-I and type-II. We present a deterministic algorithm which produce efficient disturbance vectors with respect to any given cost function. We define two simpl...
متن کاملSpeeding up detection of SHA-1 collision attacks using unavoidable attack conditions
Counter-cryptanalysis, the concept of using cryptanalytic techniques to detect cryptanalytic attacks, was first introduced by Stevens at CRYPTO 2013 [22] with a hash collision detection algorithm. That is, an algorithm that detects whether a given single message is part of a colliding message pair constructed using a cryptanalytic collision attack on MD5 or SHA-1. The concept’s utility was prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2017
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-016-9241-x